Continuous and discrete best polynomial degree reduction with Jacobi and Hahn weights
نویسندگان
چکیده
منابع مشابه
Localized Polynomial Frames on the Interval with Jacobi Weights
As is well known the kernel of the orthogonal projector onto the polynomials of degree n in L2(wα,β , [−1, 1]) with wα,β(t) = (1−t) (1+t) can be written in terms of Jacobi polynomials. It is shown that if the coefficients in this kernel are smoothed out by sampling a C∞ function then the resulting function has nearly exponential (faster than any polynomial) rate of decay away from the main diag...
متن کاملPolynomial Schauder basis of optimal degree with Jacobi orthogonality
In our paper we construct a polynomial Schauder basis (pα,β,n)n∈N0 of optimal degree with Jacobi orthogonality. A candidate for such a basis is given by the use of some wavelet theoretical methods, which were already successful in case of Tchebysheff and Legendre orthogonality. To prove that this sequence is in fact a Schauder basis for C[−1, 1] and as the main difficulty of the whole proof we ...
متن کاملM-polynomial and degree-based topological indices
Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...
متن کاملConstrained Approximation with Jacobi Weights
In this paper, we prove that for l = 1 or 2 the rate of best l-monotone polynomial approximation in the Lp norm (1 ≤ p ≤ ∞) weighted by the Jacobi weight wα ,β(x) ∶= (1 + x)α(1 − x)β with α, β > −1/p if p <∞, or α, β ≥ 0 if p =∞, is bounded by an appropriate (l + 1)-st modulus of smoothness with the same weight, and that this rate cannot be bounded by the (l+2)-ndmodulus. Related results on con...
متن کاملInner Bounds for the Extreme Zeros of the Hahn, Continuous Hahn and Continuous Dual Hahn Polynomials
We apply Zeilberger’s algorithm to generate relations of finite-type necessary to obtain inner bounds for the extreme zeros of orthogonal polynomial sequences with 3F2 hypergeometric representations. Using this method, we improve previously obtained upper bounds for the smallest and lower bounds for the largest zeros of the Hahn polynomials and we identify inner bounds for the extreme zeros of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 2016
ISSN: 0021-9045
DOI: 10.1016/j.jat.2016.02.018